{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AOMZG3II7YX5SRF3FK3VRI23TY","short_pith_number":"pith:AOMZG3II","schema_version":"1.0","canonical_sha256":"0399936d08fe2fd944bb2ab758a35b9e1e037400a0a72d0779b4ab6917f55743","source":{"kind":"arxiv","id":"1908.04104","version":1},"attestation_state":"computed","paper":{"title":"A Natural Quadratic Approach to the Generalized Graph Layering Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Sven Mallach","submitted_at":"2019-08-12T11:59:42Z","abstract_excerpt":"We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives, such as a minimum total arc length, minimum number of reversed arcs, and minimum width, or the adaptation to a specific drawing area. Our computational experiments show a competitive performance compared to prior exact models."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.04104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-12T11:59:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6f4052cdcb4ff38d0b22341379dcddb1b7a81df8cf7081b2b166304cdfe270f8","abstract_canon_sha256":"e9437924c684ed281877b8124016dbbef826bf5623f8db2b1a9179382767e724"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:20.745935Z","signature_b64":"/lhqrk4A5lr9UVVqfmTZeEzRi+mVNroSqWRiRCEpuiAANbTebikvXYYmnUOF06oiD4FpcgeWKpvOTth+hKLyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0399936d08fe2fd944bb2ab758a35b9e1e037400a0a72d0779b4ab6917f55743","last_reissued_at":"2026-07-04T23:53:20.745492Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:20.745492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Natural Quadratic Approach to the Generalized Graph Layering Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Sven Mallach","submitted_at":"2019-08-12T11:59:42Z","abstract_excerpt":"We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives, such as a minimum total arc length, minimum number of reversed arcs, and minimum width, or the adaptation to a specific drawing area. Our computational experiments show a competitive performance compared to prior exact models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04104","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04104/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.04104","created_at":"2026-07-04T23:53:20.745551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04104v1","created_at":"2026-07-04T23:53:20.745551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04104","created_at":"2026-07-04T23:53:20.745551+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOMZG3II7YX5","created_at":"2026-07-04T23:53:20.745551+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOMZG3II7YX5SRF3","created_at":"2026-07-04T23:53:20.745551+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOMZG3II","created_at":"2026-07-04T23:53:20.745551+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY","json":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY.json","graph_json":"https://pith.science/api/pith-number/AOMZG3II7YX5SRF3FK3VRI23TY/graph.json","events_json":"https://pith.science/api/pith-number/AOMZG3II7YX5SRF3FK3VRI23TY/events.json","paper":"https://pith.science/paper/AOMZG3II"},"agent_actions":{"view_html":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY","download_json":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY.json","view_paper":"https://pith.science/paper/AOMZG3II","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04104&json=true","fetch_graph":"https://pith.science/api/pith-number/AOMZG3II7YX5SRF3FK3VRI23TY/graph.json","fetch_events":"https://pith.science/api/pith-number/AOMZG3II7YX5SRF3FK3VRI23TY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY/action/storage_attestation","attest_author":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY/action/author_attestation","sign_citation":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY/action/citation_signature","submit_replication":"https://pith.science/pith/AOMZG3II7YX5SRF3FK3VRI23TY/action/replication_record"}},"created_at":"2026-07-04T23:53:20.745551+00:00","updated_at":"2026-07-04T23:53:20.745551+00:00"}